Large monochromatic components and long monochromatic cycles in random hypergraphs
نویسندگان
چکیده
منابع مشابه
Long Monochromatic Berge Cycles in Colored 4-Uniform Hypergraphs
Here we prove that for n ≥ 140, in every 3-coloring of the edges of K (4) n there is a monochromatic Berge cycle of length at least n− 10. This result sharpens an asymptotic result obtained earlier. Another result is that for n ≥ 15, in every 2-coloring of the edges of K n there is a 3-tight Berge cycle of length at least n− 10.
متن کاملCovering complete partite hypergraphs by monochromatic components
A well-known special case of a conjecture attributed to Ryser (actually appeared in the thesis of Henderson [7]) states that k-partite intersecting hypergraphs have transversals of at most k−1 vertices. An equivalent form of the conjecture in terms of coloring of complete graphs is formulated in [1]: if the edges of a complete graph K are colored with k colors then the vertex set of K can be co...
متن کاملLarge almost monochromatic subsets in hypergraphs
We show that for all l and ǫ > 0 there is a constant c = c(l, ǫ) > 0 such that every l-coloring of the triples of an N -element set contains a subset S of size c √ logN such that at least 1 − ǫ fraction of the triples of S have the same color. This result is tight up to the constant c and answers an open question of Erdős and Hajnal from 1989 on discrepancy in hypergraphs. For l ≥ 4 colors, it ...
متن کاملMonochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs
We conjecture that for any fixed r and sufficiently large n, there is a monochromatic Hamiltonian Bergecycle in every (r − 1)-coloring of the edges of K n , the complete r-uniform hypergraph on n vertices. We prove the conjecture for r = 3, n 5 and its asymptotic version for r = 4. For general r we prove weaker forms of the conjecture: there is a Hamiltonian Berge-cycle in (r−1)/2 -colorings of...
متن کاملMonochromatic Hamiltonian t-tight Berge-cycles in hypergraphs
In any r-uniform hypergraph H for 2 ≤ t ≤ r we define an runiform t-tight Berge-cycle of length , denoted by C , as a sequence of distinct vertices v1, v2, . . . , v , such that for each set (vi , vi+1, . . . ,vi+t−1 ) of t consecutive vertices on the cycle, there is an edge Ei of H that contains these t vertices and the edges Ei are all distinct for i, 1 ≤ i ≤ , where + j ≡ j. For t = 2 we get...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2019
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2018.10.001